Compressive Classification of a Mixture of Gaussians: Analysis, Designs and Geometrical Interpretation

نویسندگان

  • Hugo Reboredo
  • Francesco Renna
  • A. Robert Calderbank
  • Miguel R. D. Rodrigues
چکیده

This paper derives fundamental limits on the performance of compressive classification when the source is a mixture of Gaussians. It provides an asymptotic analysis of a Bhattacharya based upper bound on the misclassification probability for the optimal Maximum-A-Posteriori (MAP) classifier that depends on quantities that are dual to the concepts of diversity-order and coding gain in multi-antenna communications. The diversity-order of the measurement system determines the rate at which the probability of misclassification decays with signal-to-noise ratio (SNR) in the low-noise regime. The counterpart of coding gain is the measurement gain which determines the power offset of the probability of misclassification in the low-noise regime. These two quantities make it possible to quantify differences in misclassification probability between random measurement and (diversity-order) optimized measurement. Results are presented for two-class classification problems first with zero-mean Gaussians then with nonzero-mean Gaussians, and finally for multiple-class Gaussian classification problems. The behavior of misclassification probability is revealed to be intimately related to certain fundamental geometric quantities determined by the measurement system, the source and their interplay. Numerical results, representative of compressive classification of a mixture of Gaussians, demonstrate alignment of the actual misclassification probability with the Bhattacharya based upper bound. The connection between the misclassification performance and the alignment between source and measurement geometry may be used to guide the design of dictionaries for compressive classification. Index Terms Compressed sensing, compressive classification, reconstruction, classification, random projections, measurement design, dimensionality reduction, Gaussian mixture models, phase transitions, diversity gain, measurement gain. This paper was presented in part at the 2013 IEEE International Symposium on Information Theory and the 2013 IEEE Global Conference on Signal and Information Processing. The work of H. Reboredo was supported by Fundação para a Ciência e Tecnologia, Portugal, through the doctoral grant SFRH/BD/81543/2011. The work of M. R. D. Rodrigues was supported by the EPSRC through the research grant EP/K503459/1. This work was also supported by the Royal Society International Exchanges Scheme IE120996. H. Reboredo and F. Renna are with the Instituto de Telecomunicações and the Departamento de Ciência de Computadores da Faculdade de Ciências da Universidade do Porto, Portugal (email: {hugoreboredo, frarenna}@dcc.fc.up.pt). R. Calderbank is with the Department of Electrical and Computer Engineering, Duke University, NC, USA (email: [email protected]). M. R. D. Rodrigues is with the Department of Electronic and Electrical Engineering, University College London, United Kingdom (email: [email protected]). January 28, 2014 DRAFT 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IMAGE SEGMENTATION USING GAUSSIAN MIXTURE MODEL

  Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...

متن کامل

­­Image Segmentation using Gaussian Mixture Model

Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...

متن کامل

A Dynamic Merge-or-Split Learning Algorithm on Gaussian Mixture for Automated Model Selection

Gaussian mixture modelling is a powerful tool for data analysis. However, the selection of number of Gaussians in the mixture, i.e., the mixture model or scale selection, remains a difficult problem. In this paper, we propose a new kind of dynamic merge-or-split learning (DMOSL) algorithm on Gaussian mixture such that the number of Gaussians can be determined automatically with a dynamic merge-...

متن کامل

Shrinkage simplex-centroid designs for a quadratic mixture model

A simplex-centroid design for q mixture components comprises of all possible subsets of the q components, present in equal proportions. The design does not contain full mixture blends except the overall centroid. In real-life situations, all mixture blends comprise of at least a minimum proportion of each component. Here, we introduce simplex-centroid designs which contain complete blend...

متن کامل

Estimation of mechanical and durability properties of self-compacting concrete with fibers using ultrasonic pulse velocity

In this research, the performance of ultrasonic pulse velocity (UPV) in concrete is examined as a nondestructive experiment in order to estimate mechanical (compressive and tensile strength) and durability (water absorption) properties of fiber-reinforced self-compacted concrete For this purpose 11 mixture designs containing 3 types of fibers (steel: 0.1, 0.2, 0.3 and 0.4 percent by volume, Pol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1401.6962  شماره 

صفحات  -

تاریخ انتشار 2014